Clean Semantics for Calls with Repeated Arguments
نویسندگان
چکیده
When arguments are repeated in a procedure call, aliasing arises and plays havoc with specification and reasoning. To prevent this aliasing, which renders the semantics of a language unclean even when all other sources of aliasing are avoided, we propose a simple new scheme for parameter passing that uses initial values for passing second and subsequent repeated arguments and localizes the effects of calls.
منابع مشابه
Preserving Abstraction for Operation Invocations with Repeated Arguments
When arguments of non-trivial types are repeated in an operation invocation, alternative but otherwise functionally equivalent implementations often produce different results. To know what outcome to expect, a programmer is forced to examine the procedure body of the implementation currently in use. This clearly violates procedural abstraction and thwarts modular reasoning. It occurs because al...
متن کاملOn semantics in dynamic argumentation frameworks
A Timed Abstract Argumentation Framework is a novel formalism where arguments are only valid for consideration in a given period of time, which is defined for every individual argument. Thus, the attainability of attacks and defenses is related to time, and the outcome of the framework may vary accordingly. In this work we study the notion of stable extensions applied to timed-arguments. The fr...
متن کاملInput/Output Dependencies of Normal Logic Programs
SLDNF-resolution is complete for allowed programs and allowed queries. But the condition of allowedness is very stringent and excludes many common Prolog constructs. We show that allowedness is a special case of a more general principle. We show that if the clauses of a normal program are correct with respect to an input/output specification then SLDNFresolution is complete for it. An input/out...
متن کاملRecanati on the Semantics/pragmatics Distinction
One of the hottest philosophical debates in recent years concerns the nature of the semantics/pragmatics divide. Some writers have expressed the reserve that this might be merely terminological, but in my view it ultimately concerns a substantive issue with empirical implications: the scope and limits of a serious scientific undertaking, formal semantics. In this critical note I discuss two arg...
متن کاملAutomatic Testing through Planning
We describe a strategy to automatically test software built using preand postconditions. The strategy searches for valid routine calls: calls for which the preconditions are satisfied. If such calls fail (because the postcondition or another check is violated), we have found a bug. The testing strategy automatically builds a model of the software under test. The model is an abstract version of ...
متن کامل